Gradient Vector Fields of Discrete Morse Functions and Watershed-Cuts
نویسندگان
چکیده
In this paper, we study a class of discrete Morse functions, coming from Discrete Theory, that are equivalent to simplicial stacks, Mathematical Morphology. We show that, as in can see the gradient vector field stack (seen function) only relevant information should consider. Last, but not least, also Minimum Spanning Forest dual graph is induced by initial function. This result allows computing watershed-cut field.
منابع مشابه
Discrete morse gradient fields with stable matching
Forman’s discrete Morse theory for cell complexes essentially relies on a discrete analogue of gradient fields, defined as an acyclic matching between incident cells. One can easily extract from this object several pieces of topological and geometrical information of a cell complex such as homology or the Morse-Smale decomposition. Most constructions of this discrete gradient are based on some ...
متن کاملComputing a discrete Morse gradient from a watershed decomposition
We consider the problem of segmenting triangle meshes endowed with a discrete scalar function f based on the critical points of f . The watershed transform induces a decomposition of the domain of function f into regions of influence of its minima, called catchment basins. The discrete Morse gradient induced by f allows recovering not only catchment basins but also a complete topological charac...
متن کاملComputational Discrete Morse Theory for Divergence-Free 2D Vector Fields
We present a simple approach to the topological analysis of divergencefree 2D vector fields using discrete Morse theory. We make use of the fact that the point-wise perpendicular vector field can be interpreted as the gradient of the stream function. The topology of the divergence-free vector field is thereby encoded in the topology of a gradient vector field. We can therefore apply a formulati...
متن کاملLearning Watershed Cuts Energy Functions
In recent work, several popular segmentation methods have been unified as energy minimization on a graph. In other work, supervised learning methods have been generalized from predicting labels to predicting structured, graph-like objects. This paper reviews these two directions and describes how they are being combined to enable traditionally unsupervised segmentation methods to be optimized (...
متن کاملConstructing discrete Morse functions
Morse theory has been considered a powerful tool in its applications to computational topology, computer graphics and geometric modeling. It was originally formulated for smooth manifolds. Recently, Robin Forman formulated a version of this theory for discrete structures such as cell complexes. It opens up several categories of interesting objects (particularly meshes) to applications of Morse ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-19897-7_4